On the fractional chromatic number and the lexicographic product of graphs
نویسنده
چکیده
For graphs G and H let GH] be their lexicographic product and let f (G) = inff(GK n ])=n j n = 1; 2; : : :g be the fractional chromatic number of G. For n 1 set G n = fG j (GK n ]) = nn(G)g. Then lim n!1 G n = fG j f (G) = (G)g: Moreover, we prove that for any n 2 the class G n forms a proper subclass of G n?1. As a by-product we show that if G is a-extremal, vertex transitive graph on (G)(G) ? 1 vertices, then for any graph H we have (GH]) = (G)(H) ? b(H)==(G)c.
منابع مشابه
On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملOn the fractional chromatic number, the chromatic number, and graph products
It is shown that the difference between the chromatic number χ and the fractional chromatic number χf can be arbitrarily large in the class of uniquely colorable, vertex transitive graphs. For the lexicographic product G ◦ H it is shown that χ(G ◦ H) ≥ χf (G)χ(H). This bound has several consequences, in particular it unifies and extends several known lower bounds. Lower bounds of Stahl (for gen...
متن کاملMore results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number
The r-inflation of a graph G is the lexicographic product G with Kr. A graph is said to have thickness t if its edges can be partitioned into t sets, each of which induces a planar graph, and t is smallest possible. In the setting of the r-inflation of planar graphs, we investigate the generalization of Ringel’s famous Earth-Moon problem: What is the largest chromatic number of any thickness-t ...
متن کاملImproved Bounds for the Chromatic Number of the Lexicographic Product of Graphs
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and generalizes several known results is proved. It is applied in particular to characterize graphs that have a complete core. An improved lower bound is also given.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 185 شماره
صفحات -
تاریخ انتشار 1998